ANALYTICAL APPROACH TO BIT-STRING MODELS OF LANGUAGE EVOLUTION
نویسندگان
چکیده
منابع مشابه
Analytical approach to bit-string models of language evolution
A formulation of bit-string models of language evolution, based on differential equations for the population speaking each language, is introduced and preliminarily studied. Connections with replicator dynamics and diffusion processes are pointed out. The stability of the dominance state, where most of the population speaks a single language, is analyzed within a mean-field-like approximation, ...
متن کاملBit-String Models for Parasex
We present different bit-string models of haploid asexual populations in which individuals may exchange part of their genome with other individuals (parasex) according to a given probability. We study the advantages of this parasex concerning population sizes, genetic fitness and diversity. We find that the exchange of genomes always improves these features.
متن کاملa synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولBit-Parallel Approach to Approximate String Matching in Compressed Texts
In this paper, we address the problem of approximate string matching on compressed text. We consider this problem for a text string described in terms of collage system, which is a formal system proposed by Kida et al. (1999) that captures various dictionary-based compression methods. We present an algorithm that exploits bit-parallelism, assuming that our problem fits in a single machine word,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2008
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183108012340